A modified Weiszfeld algorithm for the Fermat-Weber location problem
نویسندگان
چکیده
This paper gives a new, simple, monotonically convergent, algorithm for the Fermat-Weber location problem, with extensions covering more general cost functions.
منابع مشابه
On Newton's Method for the Fermat-Weber Location Problem
This paper considers the Fermat-Weber location problem. It is shown that, after a suitable initialization, the standard Newton method can be applied to the Fermat-Weber problem and is globally and locally quadratically convergent. A numerical comparison with the popular Weiszfeld algorithm shows that Newton’s method is significantly more efficient than the Weiszfeld scheme.
متن کاملFurther Notes on Convergence of the Weiszfeld Algorithm
The Fermat-Weber problem is one of the most widely studied problems in classical location theory. In his previous work, Brimberg (1995) attempts to resolve a conjecture posed by Chandrasekaran and Tamir (1989) on a convergence property of the Weiszfeld algorithm, a well-known iterative procedure used to solve this problem. More recently, C‹novas, MarÐn and Caflavate (2002) provide counterexampl...
متن کاملA projected Weiszfeld algorithm for the box-constrained Weber location problem
The Fermat-Weber problem consists in finding a point in R that minimizes the weighted sum of distances from m points in R that are not collinear. An application that motivated this problem is the optimal location of industries in the 2-dimensional case. The Weber problem is a generalization of the well-known Fermat problem. An usual method to solve the Weber problem, proposed by Weiszfeld in 19...
متن کاملA generalized Weiszfeld method for the multi-facility location problem
The Fermat–Weber location problem (also single facility location problem) is to locate a facility that will serve optimally a set of customers, given by their locations and weights, in the sense of minimizing the weighted sum of distances traveled by the customers. A well known method for solving the problem is the Weiszfeld method [25], a gradient method that expresses and updates the sought c...
متن کاملOn the continuous Fermat-Weber problem for a convex polygon using Euclidean distance
In this paper, we consider the continuous Fermat-Weber problem, where the customers are continuously (uniformly) distributed along the boundary of a convex polygon. We derive the closed-form expression for finding the average distance from a given point to the continuously distributed customers along the boundary. A Weiszfeld-type procedure is proposed for this model, which is shown to be linea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 90 شماره
صفحات -
تاریخ انتشار 2001